منابع مشابه
Inverse Entailment in Nonmonotonic Logic Programs
Inverse entailment (IE) is known as a technique for finding inductive hypotheses in Horn theories. When a background theory is nonmonotonic, however, IE is not applicable in its present form. The purpose of this paper is extending the IE technique to nonmonotonic inductive logic programming (ILP). To this end, we first establish a new entailment theorem in normal logic programs, then introduce ...
متن کاملLogic of approximate entailment in quasimetric spaces
The logic LAE discussed in this paper is based on an approximate entailment relation. LAE generalises classical propositional logic to the effect that conclusions can be drawn with a quantified imprecision. To this end, properties are modelled by subsets of a distance space and statements are of the form that one property implies another property within a certain limit of tolerance. We adopt th...
متن کاملAutomated Cyclic Entailment Proofs in Separation Logic
We present a general automated proof procedure, based upon cyclic proof, for inductive entailments in separation logic. Our procedure has been implemented via a deep embedding of cyclic proofs in the HOL Light theorem prover. Experiments show that our mechanism is able to prove a number of non-trivial entailments involving inductive predicates.
متن کاملReducing OWL Entailment to Description Logic Satisfiability
We show how to reduce ontology entailment for the OWL DL and OWL Lite ontology languages to knowledge base satisfiability in (respectively) the and description logics. This is done by first establishing a correspondence between OWL ontologies and description logic knowledge bases and then by showing how knowledge base entailment can be reduced to knowledge base satisfiability.
متن کاملFuzzy attribute logic: syntactic entailment and completeness
Fuzzy attribute implications are particular if-then rules which can be extracted from data tables with fuzzy attributes. We develop fuzzy attribute logic (FAL), its syntax, semantics, and prove a classical as well as Pavelka-style completeness theorem for FAL. Also, we present relationships to completeness of sets of attribute implications w.r.t. data tables. Because of the limited scope of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Investigations
سال: 2013
ISSN: 2413-2713,2074-1472
DOI: 10.21146/2074-1472-2013-19-0-260-272